Polynomial time decision algorithms for probabilistic automata
نویسندگان
چکیده
منابع مشابه
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic max (min) polynomial equations, referred to as maxPPSs (and minPPSs, respectively), in time polynomial in both the encoding size of the system of equations and in log(1/ǫ), where ǫ > 0 is the desired additive error bound of the solution. (The model of computation is the standard T...
متن کاملDeciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Deciding in an efficient way weak probabilistic bisimulation in the context of probabilistic automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the existence of a weak combined transition satisfying the step condition of the bisimulation. This enables us to arrive at a polynomial time algorithm for deciding ...
متن کاملPolynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
Various models and equivalence relations or preorders for probabilistic processes are proposed in the literature. This paper deals with a model based on labelled transition systems extended to the prob-abalistic setting and gives an O(n 2 m) algorithm for testing probabilistic bisimulation and an O(n 5 m 2) algorithm for testing probabilistic simulation where n is the number of states and m the...
متن کاملOn Decision Problems for Probabilistic Büchi Automata
Probabilistic Büchi automata (PBA) are finite-state acceptors for infinite words where all choices are resolved by fixed distributions and where the accepted language is defined by the requirement that the measure of the accepting runs is positive. The main contribution of this paper is a complementation operator for PBA and a discussion on several algorithmic problems for PBA. All interesting ...
متن کاملDecision Algorithms for Probabilistic Bisimulation
We propose decision algorithms for bisimulation relations defined on probabilistic automata, a model for concurrent nondeterministic systems with randomization. The algorithms decide both strong and weak bisimulation relations based on deterministic as well as randomized schedulers. These algorithms extend and complete other known algorithms for simpler relations and models. The algorithm we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2015
ISSN: 0890-5401
DOI: 10.1016/j.ic.2015.07.004